搜索资源列表
dijkstra
- Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
ComputerTest
- 采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-Adjacency matrix are used to achieve the network storage, establishing the network, and to achieve single-source shortest path algorithm.
PenQuestionAlgorithmSolution
- 一家GIS笔试题和解决方案1集装箱摆放问题2单源最短路径3区域生长-A GIS pen and the questions and solutions to a container placed in two single-source shortest path problem 3 Regional Growth
Dijkstra_algorithm
- 最短单源路径算法 Dijkstra algorithm c++ 实现版 带测试程序和注释 在VS2008下通过调试 最短单源路径算法 Dijkstra algorithm c++ 实现版 带测试程序和注释 在VS2008下通过调试 -Single-source shortest path algorithm Dijkstra algorithm c++ version with a test program to achieve and annotations through deb
dijkstra_z
- 单源dijkstra邻接阵形式 单源最短路径,dijkstra算法,邻接阵形式,复杂度O(n^2)-Dijkstra adjacency matrix form of single-source single-source shortest path, dijkstra algorithm, adjacency matrix form, the complexity of O (n ^ 2)
dijkstra_b
- 单源最短路径,用于路权相等的情况,dijkstra优化为bfs,邻接表形式,复杂度O(m)-Single-source shortest path for the right of way case of a tie, dijkstra optimization bfs, adjacency list form, complexity of O (m)
Bellman-ford
- 单源最短路径,bellman_ford算法,邻接阵形式,复杂度O(n^3)-Single-source shortest path, bellman_ford algorithm, adjacency matrix form, the complexity of O (n ^ 3)
ijkstra_binary_heap
- 单源最短路径,dijkstra算法+二分堆,邻接表形式,复杂度O(mlogm)-Single-source shortest path, dijkstra algorithm+ 2 sub-heap, adjacency list form, complexity of O (mlogm)
dijkstra_mapped_heap
- 单源最短路径,dijkstra算法+映射二分堆,正向表形式,复杂度O(mlogn)-Single-source shortest path, dijkstra algorithm+ Mapping 2 points heap, positive list system, complexity of O (mlogn)
shortestpath
- 使用vc++实现数据结构中单源最短路径的实现，使用递归算法，比较简单-Using vc++ data structure, the realization of single-source shortest path, using a recursive algorithm, a relatively simple
Dijstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm used to calculate a node to all other nodes in the shortest path. Main features are a st
work
- 汽车导引系统flash演示 采用单源最短路径算法 输入内容为车牌，学校入口就是起始点，目的地就是终点-Flash demo vehicle guidance system using single-source shortest path algorithm for the input plate, the school entrance is the starting point, the destination is the end
tan
- 这是单源点最短路径的程序，当时是我大三做的。算法分析的课程。-This is a single-source-point shortest path procedure, was my third year to do. Analysis of algorithms courses.
spfa
- 求单源最短路的SPFA算法的全称是：Shortest Path Faster Algorithm。 这个是自己写的，思想还是一样发的。-Demand single-source shortest path algorithm SPFA name is: Shortest Path Faster Algorithm. This is his writing, and thinking is the same hair.
pos
- 实现单目标的粒子群优化问题，以鸟群寻找食物为例，怎样使鸟群在最短的时间内找到食物-Single-objective particle swarm optimization to birds looking for food, for example, how to make the birds in the shortest period of time to find food
dijkstra
- Dijkstra Algorithm - a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing.
code
- 是关于单源最短路径的，他对于我们的学习很好，很有用，自己写的呀！-On single-source shortest path, and he' s learning very well for us, very useful, write to!
BBShortest
- 用分支限界法实现单源最短路径 用分支限界法的思想-Branch and bound method with single-source shortest path with the idea of branch and bound
nroute
- 算法分析与设计中的单源点最短路径的源代码实现！-Algorithm analysis and design of single-source shortest path of the source code to achieve!